Satisfying Strong Application
نویسندگان
چکیده
In today’s data-intensive cloud systems, there is a tension between resource limitations and strict requirements. In an effort to scale up in the cloud, many systems today have unfortunately forced users to relax their requirements. However, users still have to deal with constraints, such as strict time deadlines or limited dollar budgets. Several applications critically rely on strongly consistent access to data hosted in clouds. Jobs that are time-critical must receive priority when they are submitted to shared cloud computing resources. This thesis presents systems that satisfy strong application requirements, such as consistency, dollar budgets, and real-time deadlines, for data-intensive cloud computing environments, in spite of resource limitations, such as bandwidth, congestion, and resource costs, while optimizing system metrics, such as throughput and latency. Our systems cover a wide range of environments, each with their own strict requirements. Pandora gives cloud users with deadline or budget constraints the optimal solution for transferring bulk data within these constraints. Vivace provides applications with a strongly consistent storage service that performs well when replicated across geo-distributed data centers. Natjam ensures that time-critical Hadoop jobs immediately receive cluster resources even when less important jobs are already running. For each of these systems, we designed new algorithms and techniques aimed at making the most of the limited resources available. We implemented the systems and evaluated their performance under deployment using real-world data and execution traces.
منابع مشابه
A note on generalization of Zermelo navigation problem on Riemannian manifolds with strong perturbation
We generalize the Zermelo navigation on Riemannian manifolds (M,h), admitting a space dependence of a ship's speed 0 < |u(x)|h ≤ 1 in the presence of a perturbation W̃ determined by a strong (critical) velocity vector eld satisfying |W̃ (x)|h = |u(x)|h, with application of Finsler metric of Kropina type.
متن کاملPseudomonotone Functions and an Application in the Theory of General Economic Equilibrium
In this paper, a strong version of Wald’s Axiom of excess demand functions Z : P ⊂ IR >0 → IR n is introduced, namely “there exists σ > 0 such that p, q ∈ P, qZ(p) − δ ≤ 0, |δ| < σ, and Z(q) 6= Z(p) imply pZ(q) + δ > 0”. We show that Z satisfies the strong version of Wald’s Axiom iff −Z is a s-quasimonotone function introduced in An (2006). Consequently, an excess demand function Z satisfies th...
متن کاملCombining properties of cryptographic hash functions
A “strong” cryptographic hash function suitable for practical applications should simultaneously satisfy many security properties, like pseudo-randomness, collision resistance and unforgeability. This paper shows how to combine two hash function families each satisfying different security property into one hash function family, which satisfies both properties. In particular, given two hash func...
متن کاملIterative Process for an α- Nonexpansive Mapping and a Mapping Satisfying Condition(C) in a Convex Metric Space
We construct one-step iterative process for an α- nonexpansive mapping and a mapping satisfying condition (C) in the framework of a convex metric space. We study △-convergence and strong convergence of the iterative process to the common fixed point of the mappings. Our results are new and are valid in hyperbolic spaces, CAT(0) spaces, Banach spaces and Hilbert spaces, simultaneously.
متن کاملRandom fixed point theorems with an application to a random nonlinear integral equation
In this paper, stochastic generalizations of some fixed point for operators satisfying random contractively generalized hybrid and some other contractive condition have been proved. We discuss also the existence of a solution to a nonlinear random integral equation in Banah spaces.
متن کاملThe Discrete Lagrangian Theory and Its Application to Solve Nonlinear Discrete Constrained Optimization Problems
In this research we present new results on discrete Lagrangian methods (DLM) and extend our previous (incomplete and highly simpli ed) theory on the method. Our proposed method forms a strong mathematical foundation for solving general nonlinear discrete optimization problems. Speci cally, we show for continuous Lagrangian methods the relationship among local minimal solutions satisfying constr...
متن کامل